Reduction on Propositional Logic Set Based on Correlation Analysis
نویسنده
چکیده
A knowledge base is redundant if it contains parts that can be inferred from the rest of it. In this paper, with no district bound, we study the reduction theory and algorithm on proposition logic set. The propositions of a given proposition set fall into three categories: necessary proposition, useful proposition, and useless proposition. A reduction of a given set is composed of all the necessary propositions and some useful propositions. At the beginning we introduce induced formal context of proposition set, and then propose the method of reduction on proposition set based on correlation analysis.
منابع مشابه
Representation and Reduction of Decision System Based on Semantics of Extended Propositional Modal Logic
To direct at the characteristic of the decision system based on Rough set theory, the proposition modal logic is extended by adding the attribute constants as the basic symbols, and the formal system of the extended propositional modal logic as well as its semantics are described. Since every decision system based on Rough set theory can be expressed by a decision system based on the semantics ...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملQuantified Propositional Gödel Logic
It is shown that G ↑ , the quantified propositional Gödel logic based on the truth-value set V↑ = {1− 1/n : n ≥ 1} ∪ {1}, is decidable. This result is obtained by reduction to Büchi’s theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of G ↑ as the intersection of all finite-valued quantified proposition...
متن کاملReducing Inductive Definitions to Propositional Satisfiability
The FO(ID) logic is an extension of classical first-order logic with a uniform representation of various forms of inductive definitions. The definitions are represented as sets of rules and they are interpreted by two-valued well-founded models. For a large class of combinatorial and search problems, knowledge representation in FO(ID) offers a viable alternative to the paradigm of Answer Set Pr...
متن کاملUndecidability of the problem of recognizing axiomatizations for propositional calculi with implication
In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability of the following problem for these calculi: whether a given finite set of propositional formulas constitutes an adequate axiom system for a fixed proposition...
متن کامل